YES 0.9540000000000001
↳ HASKELL
↳ LR
((fmToList_GE :: FiniteMap Bool a -> Bool -> [(Bool,a)]) :: FiniteMap Bool a -> Bool -> [(Bool,a)]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||||||||||||
fmToList_GE :: Ord a => FiniteMap a b -> a -> [(a,b)]
|
|||||||||||||||||||
foldFM_GE :: Ord b => (b -> c -> a -> a) -> a -> b -> FiniteMap b c -> a
|
import qualified FiniteMap import qualified Prelude |
\keyeltrest→(key,elt) : rest
fmToList_GE0 key elt rest = (key,elt) : rest
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
((fmToList_GE :: FiniteMap Bool a -> Bool -> [(Bool,a)]) :: FiniteMap Bool a -> Bool -> [(Bool,a)]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||||||||||||
fmToList_GE :: Ord a => FiniteMap a b -> a -> [(a,b)]
|
|||||||||||||||||||
|
|||||||||||||||||||
foldFM_GE :: Ord c => (c -> b -> a -> a) -> a -> c -> FiniteMap c b -> a
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((fmToList_GE :: FiniteMap Bool a -> Bool -> [(Bool,a)]) :: FiniteMap Bool a -> Bool -> [(Bool,a)]) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||||||||||||
fmToList_GE :: Ord a => FiniteMap a b -> a -> [(a,b)]
|
|||||||||||||||||||
|
|||||||||||||||||||
foldFM_GE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b
|
import qualified FiniteMap import qualified Prelude |
foldFM_GE k z fr EmptyFM = z foldFM_GE k z fr (Branch key elt vw fm_l fm_r)
| key >= fr
= foldFM_GE k (k key elt (foldFM_GE k z fr fm_r)) fr fm_l | otherwise
= foldFM_GE k z fr fm_r
foldFM_GE k z fr EmptyFM = foldFM_GE3 k z fr EmptyFM foldFM_GE k z fr (Branch key elt vw fm_l fm_r) = foldFM_GE2 k z fr (Branch key elt vw fm_l fm_r)
foldFM_GE1 k z fr key elt vw fm_l fm_r True = foldFM_GE k (k key elt (foldFM_GE k z fr fm_r)) fr fm_l foldFM_GE1 k z fr key elt vw fm_l fm_r False = foldFM_GE0 k z fr key elt vw fm_l fm_r otherwise
foldFM_GE0 k z fr key elt vw fm_l fm_r True = foldFM_GE k z fr fm_r
foldFM_GE2 k z fr (Branch key elt vw fm_l fm_r) = foldFM_GE1 k z fr key elt vw fm_l fm_r (key >= fr)
foldFM_GE3 k z fr EmptyFM = z foldFM_GE3 wv ww wx wy = foldFM_GE2 wv ww wx wy
compare x y
| x == y
= EQ | x <= y
= LT | otherwise
= GT
compare x y = compare3 x y
compare0 x y True = GT
compare2 x y True = EQ compare2 x y False = compare1 x y (x <= y)
compare1 x y True = LT compare1 x y False = compare0 x y otherwise
compare3 x y = compare2 x y (x == y)
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(fmToList_GE :: FiniteMap Bool a -> Bool -> [(Bool,a)]) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||
instance (Eq a, Eq b) => Eq (FiniteMap a b) where |
|||||||||
fmToList_GE :: Ord b => FiniteMap b a -> b -> [(b,a)]
|
|||||||||
|
|||||||||
foldFM_GE :: Ord c => (c -> a -> b -> b) -> b -> c -> FiniteMap c a -> b
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
new_foldFM_GE0(wz31, wz6, Branch(wz330, wz331, wz332, wz333, wz334), h) → new_foldFM_GE1(new_fmToList_GE0(wz31, wz6, h), wz330, wz331, wz332, wz333, wz334, h)
new_foldFM_GE(wz9, Branch(wz3340, wz3341, wz3342, wz3343, wz3344), h) → new_foldFM_GE1(wz9, wz3340, wz3341, wz3342, wz3343, wz3344, h)
new_foldFM_GE1(wz9, True, wz331, wz332, wz333, Branch(wz3340, wz3341, wz3342, wz3343, wz3344), h) → new_foldFM_GE1(wz9, wz3340, wz3341, wz3342, wz3343, wz3344, h)
new_foldFM_GE1(wz9, True, wz331, wz332, wz333, wz334, h) → new_foldFM_GE0(wz331, new_foldFM_GE2(wz9, wz334, h), wz333, h)
new_foldFM_GE1(wz9, False, wz331, wz332, wz333, wz334, h) → new_foldFM_GE(wz9, wz334, h)
new_fmToList_GE0(wz31, wz6, h) → :(@2(True, wz31), wz6)
new_foldFM_GE2(wz9, Branch(wz3340, wz3341, wz3342, wz3343, wz3344), h) → new_foldFM_GE10(wz9, wz3340, wz3341, wz3342, wz3343, wz3344, h)
new_foldFM_GE10(wz9, False, wz331, wz332, wz333, wz334, h) → new_foldFM_GE2(wz9, wz334, h)
new_foldFM_GE10(wz9, True, wz331, wz332, wz333, wz334, h) → new_foldFM_GE3(wz331, new_foldFM_GE2(wz9, wz334, h), wz333, h)
new_foldFM_GE3(wz31, wz6, EmptyFM, h) → new_fmToList_GE0(wz31, wz6, h)
new_foldFM_GE2(wz9, EmptyFM, h) → wz9
new_foldFM_GE3(wz31, wz6, Branch(wz330, wz331, wz332, wz333, wz334), h) → new_foldFM_GE10(new_fmToList_GE0(wz31, wz6, h), wz330, wz331, wz332, wz333, wz334, h)
new_foldFM_GE2(x0, EmptyFM, x1)
new_foldFM_GE3(x0, x1, EmptyFM, x2)
new_foldFM_GE10(x0, False, x1, x2, x3, x4, x5)
new_foldFM_GE2(x0, Branch(x1, x2, x3, x4, x5), x6)
new_foldFM_GE10(x0, True, x1, x2, x3, x4, x5)
new_foldFM_GE3(x0, x1, Branch(x2, x3, x4, x5, x6), x7)
new_fmToList_GE0(x0, x1, x2)
From the DPs we obtained the following set of size-change graphs:
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
new_foldFM_GE4(wz10, Branch(False, wz331, wz332, wz333, wz334), h) → new_foldFM_GE4(new_fmToList_GE00(wz331, new_foldFM_GE5(wz10, wz334, h), h), wz333, h)
new_foldFM_GE4(wz10, Branch(False, wz331, wz332, wz333, wz334), h) → new_foldFM_GE4(wz10, wz334, h)
new_foldFM_GE4(wz10, Branch(True, wz331, wz332, wz333, wz334), h) → new_foldFM_GE4(new_fmToList_GE0(wz331, new_foldFM_GE5(wz10, wz334, h), h), wz333, h)
new_foldFM_GE4(wz10, Branch(True, wz331, wz332, wz333, wz334), h) → new_foldFM_GE4(wz10, wz334, h)
new_fmToList_GE0(wz31, wz6, h) → :(@2(True, wz31), wz6)
new_foldFM_GE5(wz10, Branch(True, wz331, wz332, wz333, wz334), h) → new_foldFM_GE5(new_fmToList_GE0(wz331, new_foldFM_GE5(wz10, wz334, h), h), wz333, h)
new_fmToList_GE00(wz31, wz11, h) → :(@2(False, wz31), wz11)
new_foldFM_GE5(wz10, Branch(False, wz331, wz332, wz333, wz334), h) → new_foldFM_GE5(new_fmToList_GE00(wz331, new_foldFM_GE5(wz10, wz334, h), h), wz333, h)
new_foldFM_GE5(wz10, EmptyFM, h) → wz10
new_foldFM_GE5(x0, EmptyFM, x1)
new_fmToList_GE00(x0, x1, x2)
new_foldFM_GE5(x0, Branch(False, x1, x2, x3, x4), x5)
new_foldFM_GE5(x0, Branch(True, x1, x2, x3, x4), x5)
new_fmToList_GE0(x0, x1, x2)
From the DPs we obtained the following set of size-change graphs:
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
new_foldFM_GE6(True, Branch(False, wz31, wz32, wz33, wz34), h) → new_foldFM_GE6(True, wz34, h)
new_foldFM_GE6(True, Branch(True, wz31, wz32, wz33, wz34), h) → new_foldFM_GE6(True, wz34, h)
From the DPs we obtained the following set of size-change graphs: